Computational Problems in the Braid Group with Applications to Cryptography
نویسنده
چکیده
After making some basic definitions and results on links and braids, we focus on computational problems concerning the braid group such as the word and conjugacy problems and examine the recent use of the braid group and these problems in cryptography. We finally consider the NP-completeness of the NON-MINIMAL BRAIDS problem. We also briefly present some open problems as well as some basic notions of the theory of computation.
منابع مشابه
An Overview of Braid Group Cryptography
The past several years have seen an explosion of interest in the cryptographic applications of non-commutative groups. Braid groups in particular are especially desirable, as they provide difficult computational problems and can be implemented quite efficiently. Several different groups of researchers have proposed numerous cryptographic protocols that make use of braid groups, but unfortunatel...
متن کاملGroup Signature Schemes Using Braid Groups
Artin’s braid groups have been recently suggested as a new source for public-key cryptography. In this paper we propose the first group signature schemes based on the conjugacy problem, decomposition problem and root problem in the braid groups which are believed to be hard problems.
متن کاملBraid Group Cryptography Preliminary Draft
In the last decade, a number of public key cryptosystems based on combinatorial group theoretic problems in braid groups have been proposed. Our tutorial is aimed at presenting these cryptosystems and some known attacks on them. We start with some basic facts on braid groups and on the Garside normal form of its elements. We then present some known algorithms for solving the word problem in the...
متن کاملBraid Group Cryptography
In the last decade, a number of public key cryptosystems based on combinatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts on braid groups and on the Garside normal form of its elements, some known algorithms for solving the word problem in the braid group, the major public-key cryp...
متن کاملBraid Compression
In this paper, we describe the braid group, first mentioned in [2]. We give applications to cryptography mentioned in [1] and [8]. We then describe an apparently new method for shortening braid descriptions which could be useful for transmitting braids over a limited bandwidth channel.
متن کامل